Eecient Transitive Closure Computation
نویسندگان
چکیده
We present two new transitive closure algorithms that are based on strong component detection. The algorithms scan the input graph only once without generating partial successor sets for each node. The new algorithms eliminate the redundancy caused by strong components more e ciently than previous transitive closure algorithms. We present statistically sound simulation experiments showing that the new algorithms are more e cient than previous ones. We also describe a compact representation for the successor sets of the transitive closure that can be used together with the new algorithms. The new representation saves much space and reduces the number of operations needed in successor set construction. We show that the representation often eliminates redundant computations caused by multiple paths between pairs of nodes.
منابع مشابه
Model Checking and Transitive - Closure Logic ? Neil Immerman ? ?
We give a linear-time algorithm to translate any formula from computation tree logic (CTL or CTL*) into an equivalent expression in a variable-connned fragment of transitive-closure logic FO(TC). Traditionally, CTL and CTL ? have been used to express queries for model checking and then translated into-calculus for symbolic evaluation. Evaluation of-calculus formulas is, however, complete for ti...
متن کاملOn the PVM Computations of Transitive Closure and Algebraic Path Problems
We investigate experimentally, alternative approaches to the distributed parallel computation of a class of problems related to the generic transitive closure problem and the algebraic path problem. Our main result is the comparison of two parallel algorithms for transitive closure, { a straightforward coarse-grained parallel implementation of the Warshall algorithm named Block-Processing (whic...
متن کاملEecient State Classiication of Finite-state Markov Chains
This paper presents an e cient method for state classi cation of nite state Markov chains using BDD-based symbolic techniques. The method exploits the fundamental properties of a Markov chain and classi es the state space by iteratively applying reachability analysis. We compare our method with the current state-of-the-art technique which requires the computation of the transitive closure of th...
متن کاملImplementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB
This paper describes an experimental performance study of the parallel computation of transitive closure operations on a parallel database system. This work brings two research eeorts together. The rst is the development of an eecient execution strategy for the parallel computation of path problems, called the Disconnection Set Approach. The second is the development and implementation of a par...
متن کاملOn the Cost of Transitive Closures in Relational Databases
We consider the question of taking transitive closures on top of pure relational systems (Sybase and Ingres in this case). We developed three kinds of transitive closure programs , one using a stored procedure to simulate a built-in transitive closure operator, one using the C language embedded with SQL statements to simulate the iterated execution of the transitive closure operation, and one u...
متن کامل